Dynamically reacting to events within a data storage system

ABSTRACT

A computer-implemented method according to one embodiment includes identifying an event associated with data stored in a data storage system, determining a policy rule that is triggered in response to the event, and implementing one or more actions according to the policy rule.

BACKGROUND

The present invention relates to data storage, and more specifically,this invention relates to dynamically responding to events occurringwithin a data storage system.

A storage system is a commonly used component of an enterprise's storagestack. Some components may exist above it, such as content managers andschedulers, and some components function below it, such as block, tapeor archival storage. The storage system presents a consistent image ofdata to the layers above it. The storage system also provides a commondata repository regardless of how the data is accessed, be it a file,object, database, etc.

Information associated with data stored within the storage system is ofgreat value to other components, such as components above the storagesystem. However, current storage systems are unable to identify, report,and react to data-driven events occurring within the data storagesystem.

SUMMARY

A computer-implemented method according to one embodiment includesidentifying an event associated with data stored in a data storagesystem, determining a policy rule that is triggered in response to theevent, and implementing one or more actions according to the policyrule.

According to another embodiment, a computer program product fordynamically reacting to events within a data storage system comprises acomputer readable storage medium having program instructions embodiedtherewith, wherein the computer readable storage medium is not atransitory signal per se, and where the program instructions areexecutable by a processor to cause the processor to perform a methodcomprising identifying an event associated with data stored in the datastorage system, utilizing the processor, determining a policy rule thatis triggered in response to the event, utilizing the processor, andimplementing one or more actions according to the policy rule, utilizingthe processor.

A system according to another embodiment includes a processor, and logicintegrated with the processor, executable by the processor, orintegrated with and executable by the processor, the logic beingconfigured to identify an event associated with data stored in a datastorage system, determine a policy rule that is triggered in response tothe event, and implement one or more actions according to the policyrule.

A computer-implemented method according to one embodiment includesreceiving, at a data storage system, a policy rule input by a user,tagging, at the data storage system, the policy rule with a nameindicating a type of event to which the policy rule applies, andpersistently storing the policy rule in an ordered list of policy rulesthat is evaluated at each junction in a data path of the data storagesystem.

A computer-implemented method according to one embodiment includesidentifying a junction within a control path of a data storage system,retrieving data associated with the junction, comparing the data to aplurality of stored policy rules for the data storage system,determining a policy rule that applies to the data associated with thejunction, and performing one or more actions dictated by the policy rulethat apply to the data associated with the junction.

Other aspects and embodiments of the present invention will becomeapparent from the following detailed description, which, when taken inconjunction with the drawings, illustrate by way of example theprinciples of the invention.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 depicts a cloud computing node according to an embodiment of thepresent invention.

FIG. 2 depicts a cloud computing environment according to an embodimentof the present invention.

FIG. 3 depicts abstraction model layers according to an embodiment ofthe present invention.

FIG. 4 illustrates a tiered data storage system in accordance with oneembodiment.

FIG. 5 illustrates a flowchart of a method for dynamically reacting toevents within a data storage system, in accordance with one embodiment.

FIG. 6 illustrates a flowchart of a method for creating and storing apolicy rule within a data storage system, in accordance with oneembodiment.

FIG. 7 illustrates a flowchart of a method for triggering andimplementing a policy rule within a data storage system, in accordancewith one embodiment.

FIG. 8 illustrates a flowchart of a method for dynamically managing astorage tier of a data storage system, in accordance with oneembodiment.

FIG. 9 illustrates a flowchart of a method for dynamically managing afile event on a file, in accordance with one embodiment.

FIG. 10 illustrates a flowchart of a method for dynamically managing aburst buffer, in accordance with one embodiment.

FIG. 11 illustrates a flowchart of a method for adding a file to a burstbuffer, in accordance with one embodiment.

DETAILED DESCRIPTION

The following description discloses several preferred embodiments ofsystems, methods and computer program products for dynamically reactingto events within a data storage system. Various embodiments provide amethod for identifying a storage system event, identifying a policy rulethat applies to the storage system event, and performing actions basedon the policy rule.

The following description is made for the purpose of illustrating thegeneral principles of the present invention and is not meant to limitthe inventive concepts claimed herein. Further, particular featuresdescribed herein can be used in combination with other describedfeatures in each of the various possible combinations and permutations.

Unless otherwise specifically defined herein, all terms are to be giventheir broadest possible interpretation including meanings implied fromthe specification as well as meanings understood by those skilled in theart and/or as defined in dictionaries, treatises, etc.

It must also be noted that, as used in the specification and theappended claims, the singular forms “a,” “an” and “the” include pluralreferents unless otherwise specified. It will be further understood thatthe terms “includes” and/or “comprising,” when used in thisspecification, specify the presence of stated features, integers, steps,operations, elements, and/or components, but do not preclude thepresence or addition of one or more other features, integers, steps,operations, elements, components, and/or groups thereof.

The following description discloses several preferred embodiments ofsystems, methods and computer program products for dynamically reactingto events within a data storage system.

In one general embodiment, a computer-implemented method includesidentifying an event associated with data stored in a data storagesystem, determining a policy rule that is triggered in response to theevent, and implementing one or more actions according to the policyrule.

In another general embodiment, a computer program product fordynamically reacting to events within a data storage system comprises acomputer readable storage medium having program instructions embodiedtherewith, wherein the computer readable storage medium is not atransitory signal per se, and where the program instructions areexecutable by a processor to cause the processor to perform a methodcomprising identifying an event associated with data stored in the datastorage system, utilizing the processor, determining a policy rule thatis triggered in response to the event, utilizing the processor, andimplementing one or more actions according to the policy rule, utilizingthe processor.

In another general embodiment, a system includes a processor, and logicintegrated with the processor, executable by the processor, orintegrated with and executable by the processor, the logic beingconfigured to identify an event associated with data stored in a datastorage system, determine a policy rule that is triggered in response tothe event, and implement one or more actions according to the policyrule.

In another general embodiment, a computer-implemented method includesreceiving, at a data storage system, a policy rule input by a user,tagging, at the data storage system, the policy rule with a nameindicating a type of event to which the policy rule applies, andpersistently storing the policy rule in an ordered list of policy rulesthat is evaluated at each junction in a data path of the data storagesystem.

In another general embodiment, a computer-implemented method includesidentifying a junction within a control path of a data storage system,retrieving data associated with the junction, comparing the data to aplurality of stored policy rules for the data storage system,determining a policy rule that applies to the data associated with thejunction, and performing one or more actions dictated by the policy rulethat apply to the data associated with the junction.

It is understood in advance that although this disclosure includes adetailed description on cloud computing, implementation of the teachingsrecited herein are not limited to a cloud computing environment. Rather,embodiments of the present invention are capable of being implemented inconjunction with any other type of computing environment now known orlater developed.

Cloud computing is a model of service delivery for enabling convenient,on-demand network access to a shared pool of configurable computingresources (e.g. networks, network bandwidth, servers, processing,memory, storage, applications, virtual machines, and services) that canbe rapidly provisioned and released with minimal management effort orinteraction with a provider of the service. This cloud model may includeat least five characteristics, at least three service models, and atleast four deployment models.

Characteristics are as follows:

On-demand self-service: a cloud consumer can unilaterally provisioncomputing capabilities, such as server time and network storage, asneeded automatically without requiring human interaction with theservice's provider.

Broad network access: capabilities are available over a network andaccessed through standard mechanisms that promote use by heterogeneousthin or thick client platforms (e.g., mobile phones, laptops, and PDAs).

Resource pooling: the provider's computing resources are pooled to servemultiple consumers using a multi-tenant model, with different physicaland virtual resources dynamically assigned and reassigned according todemand. There is a sense of location independence in that the consumergenerally has no control or knowledge over the exact location of theprovided resources but may be able to specify location at a higher levelof abstraction (e.g., country, state, or datacenter).

Rapid elasticity: capabilities can be rapidly and elasticallyprovisioned, in some cases automatically, to quickly scale out andrapidly released to quickly scale in. To the consumer, the capabilitiesavailable for provisioning often appear to be unlimited and can bepurchased in any quantity at any time.

Measured service: cloud systems automatically control and optimizeresource use by leveraging a metering capability at some level ofabstraction appropriate to the type of service (e.g., storage,processing, bandwidth, and active user accounts). Resource usage can bemonitored, controlled, and reported providing transparency for both theprovider and consumer of the utilized service.

Service Models are as follows:

Software as a Service (SaaS): the capability provided to the consumer isto use the provider's applications running on a cloud infrastructure.The applications are accessible from various client devices through athin client interface such as a web browser (e.g., web-based e-mail).The consumer does not manage or control the underlying cloudinfrastructure including network, servers, operating systems, storage,or even individual application capabilities, with the possible exceptionof limited user-specific application configuration settings.

Platform as a Service (PaaS): the capability provided to the consumer isto deploy onto the cloud infrastructure consumer-created or acquiredapplications created using programming languages and tools supported bythe provider. The consumer does not manage or control the underlyingcloud infrastructure including networks, servers, operating systems, orstorage, but has control over the deployed applications and possiblyapplication hosting environment configurations.

Infrastructure as a Service (IaaS): the capability provided to theconsumer is to provision processing, storage, networks, and otherfundamental computing resources where the consumer is able to deploy andrun arbitrary software, which can include operating systems andapplications. The consumer does not manage or control the underlyingcloud infrastructure but has control over operating systems, storage,deployed applications, and possibly limited control of select networkingcomponents (e.g., host firewalls).

Deployment Models are as follows:

Private cloud: the cloud infrastructure is operated solely for anorganization. It may be managed by the organization or a third party andmay exist on-premises or off-premises.

Community cloud: the cloud infrastructure is shared by severalorganizations and supports a specific community that has shared concerns(e.g., mission, security requirements, policy, and complianceconsiderations). It may be managed by the organizations or a third partyand may exist on-premises or off-premises.

Public cloud: the cloud infrastructure is made available to the generalpublic or a large industry group and is owned by an organization sellingcloud services.

Hybrid cloud: the cloud infrastructure is a composition of two or moreclouds (private, community, or public) that remain unique entities butare bound together by standardized or proprietary technology thatenables data and application portability (e.g., cloud bursting forload-balancing between clouds).

A cloud computing environment is service oriented with a focus onstatelessness, low coupling, modularity, and semantic interoperability.At the heart of cloud computing is an infrastructure comprising anetwork of interconnected nodes.

Referring now to FIG. 1, a schematic of an example of a cloud computingnode is shown. Cloud computing node 10 is only one example of a suitablecloud computing node and is not intended to suggest any limitation as tothe scope of use or functionality of embodiments of the inventiondescribed herein. Regardless, cloud computing node 10 is capable ofbeing implemented and/or performing any of the functionality set forthhereinabove.

In cloud computing node 10 there is a computer system/server 12, whichis operational with numerous other general purpose or special purposecomputing system environments or configurations. Examples of well-knowncomputing systems, environments, and/or configurations that may besuitable for use with computer system/server 12 include, but are notlimited to, personal computer systems, server computer systems, thinclients, thick clients, hand-held or laptop devices, multiprocessorsystems, microprocessor-based systems, set top boxes, programmableconsumer electronics, network PCs, minicomputer systems, mainframecomputer systems, and distributed cloud computing environments thatinclude any of the above systems or devices, and the like.

Computer system/server 12 may be described in the general context ofcomputer system-executable instructions, such as program modules, beingexecuted by a computer system. Generally, program modules may includeroutines, programs, objects, components, logic, data structures, and soon that perform particular tasks or implement particular abstract datatypes. Computer system/server 12 may be practiced in distributed cloudcomputing environments where tasks are performed by remote processingdevices that are linked through a communications network. In adistributed cloud computing environment, program modules may be locatedin both local and remote computer system storage media including memorystorage devices.

As shown in FIG. 1, computer system/server 12 in cloud computing node 10is shown in the form of a general-purpose computing device. Thecomponents of computer system/server 12 may include, but are not limitedto, one or more processors or processing units 16, a system memory 28,and a bus 18 that couples various system components including systemmemory 28 to processor 16.

Bus 18 represents one or more of any of several types of bus structures,including a memory bus or memory controller, a peripheral bus, anaccelerated graphics port, and a processor or local bus using any of avariety of bus architectures. By way of example, and not limitation,such architectures include Industry Standard Architecture (ISA) bus,Micro Channel Architecture (MCA) bus, Enhanced ISA (EISA) bus, VideoElectronics Standards Association (VESA) local bus, and PeripheralComponent Interconnects (PCI) bus.

Computer system/server 12 typically includes a variety of computersystem readable media. Such media may be any available media that isaccessible by computer system/server 12, and it includes both volatileand non-volatile media, removable and non-removable media.

System memory 28 can include computer system readable media in the formof volatile memory, such as random access memory (RAM) 30 and/or cachememory 32. Computer system/server 12 may further include otherremovable/non-removable, volatile/non-volatile computer system storagemedia. By way of example only, storage system 34 can be provided forreading from and writing to a non-removable, non-volatile magnetic media(not shown and typically called a “hard drive”). Although not shown, amagnetic disk drive for reading from and writing to a removable,non-volatile magnetic disk (e.g., a “floppy disk”), and an optical diskdrive for reading from or writing to a removable, non-volatile opticaldisk such as a CD-ROM, DVD-ROM or other optical media can be provided.In such instances, each can be connected to bus 18 by one or more datamedia interfaces. As will be further depicted and described below,memory 28 may include at least one program product having a set (e.g.,at least one) of program modules that are configured to carry out thefunctions of embodiments of the invention.

Program/utility 40, having a set (at least one) of program modules 42,may be stored in memory 28 by way of example, and not limitation, aswell as an operating system, one or more application programs, otherprogram modules, and program data. Each of the operating system, one ormore application programs, other program modules, and program data orsome combination thereof, may include an implementation of a networkingenvironment. Program modules 42 generally carry out the functions and/ormethodologies of embodiments of the invention as described herein.

Computer system/server 12 may also communicate with one or more externaldevices 14 such as a keyboard, a pointing device, a display 24, etc.;one or more devices that enable a user to interact with computersystem/server 12; and/or any devices (e.g., network card, modem, etc.)that enable computer system/server 12 to communicate with one or moreother computing devices. Such communication can occur via Input/Output(I/O) interfaces 22. Still yet, computer system/server 12 cancommunicate with one or more networks such as a local area network(LAN), a general wide area network (WAN), and/or a public network (e.g.,the Internet) via network adapter 20. As depicted, network adapter 20communicates with the other components of computer system/server 12 viabus 18. It should be understood that although not shown, other hardwareand/or software components could be used in conjunction with computersystem/server 12. Examples, include, but are not limited to: microcode,device drivers, redundant processing units, external disk drive arrays,RAID systems, tape drives, and data archival storage systems, etc.

Referring now to FIG. 2, illustrative cloud computing environment 50 isdepicted. As shown, cloud computing environment 50 includes one or morecloud computing nodes 10 with which local computing devices used bycloud consumers, such as, for example, personal digital assistant (PDA)or cellular telephone 54A, desktop computer 54B, laptop computer 54C,and/or automobile computer system 54N may communicate. Nodes 10 maycommunicate with one another. They may be grouped (not shown) physicallyor virtually, in one or more networks, such as Private, Community,Public, or Hybrid clouds as described hereinabove, or a combinationthereof. This allows cloud computing environment 50 to offerinfrastructure, platforms and/or software as services for which a cloudconsumer does not need to maintain resources on a local computingdevice. It is understood that the types of computing devices 54A-N shownin FIG. 2 are intended to be illustrative only and that computing nodes10 and cloud computing environment 50 can communicate with any type ofcomputerized device over any type of network and/or network addressableconnection (e.g., using a web browser).

Referring now to FIG. 3, a set of functional abstraction layers providedby cloud computing environment 50 (FIG. 2) is shown. It should beunderstood in advance that the components, layers, and functions shownin FIG. 3 are intended to be illustrative only and embodiments of theinvention are not limited thereto. As depicted, the following layers andcorresponding functions are provided:

Hardware and software layer 60 includes hardware and softwarecomponents. Examples of hardware components include: mainframes 61; RISC(Reduced Instruction Set Computer) architecture based servers 62;servers 63; blade servers 64; storage devices 65; and networks andnetworking components 66. In some embodiments, software componentsinclude network application server software 67 and database software 68.

Virtualization layer 70 provides an abstraction layer from which thefollowing examples of virtual entities may be provided: virtual servers71; virtual storage 72; virtual networks 73, including virtual privatenetworks; virtual applications and operating systems 74; and virtualclients 75.

In one example, management layer 80 may provide the functions describedbelow. Resource provisioning 81 provides dynamic procurement ofcomputing resources and other resources that are utilized to performtasks within the cloud computing environment. Metering and Pricing 82provide cost tracking as resources are utilized within the cloudcomputing environment, and billing or invoicing for consumption of theseresources. In one example, these resources may include applicationsoftware licenses. Security provides identity verification for cloudconsumers and tasks, as well as protection for data and other resources.User portal 83 provides access to the cloud computing environment forconsumers and system administrators. Service level management 84provides cloud computing resource allocation and management such thatrequired service levels are met. Service Level Agreement (SLA) planningand fulfillment 85 provide pre-arrangement for, and procurement of,cloud computing resources for which a future requirement is anticipatedin accordance with an SLA.

Workloads layer 90 provides examples of functionality for which thecloud computing environment may be utilized. Examples of workloads andfunctions which may be provided from this layer include: mapping andnavigation 91; software development and lifecycle management 92; virtualclassroom education delivery 93; data analytics processing 94;transaction processing 95; and data storage and management 96.

Now referring to FIG. 4, a storage system 400 is shown according to oneembodiment. Note that some of the elements shown in FIG. 4 may beimplemented as hardware and/or software, according to variousembodiments. The storage system 400 may include a storage system manager412 for communicating with a plurality of media on at least one higherstorage tier 402 and at least one lower storage tier 406. The higherstorage tier(s) 402 preferably may include one or more random accessand/or direct access media 404, such as hard disks in hard disk drives(HDDs), nonvolatile memory (NVM), solid state memory in solid statedrives (SSDs), flash memory, SSD arrays, flash memory arrays, etc.,and/or others noted herein or known in the art. The lower storagetier(s) 406 may preferably include one or more lower performing storagemedia 408, including sequential access media such as magnetic tape intape drives and/or optical media, slower accessing HDDs, sloweraccessing SSDs, etc., and/or others noted herein or known in the art.One or more additional storage tiers 416 may include any combination ofstorage memory media as desired by a designer of the system 400. Also,any of the higher storage tiers 402 and/or the lower storage tiers 406may include some combination of storage devices and/or storage media.

The storage system manager 412 may communicate with the storage media404, 408 on the higher storage tier(s) 402 and lower storage tier(s) 406through a network 410, such as a storage area network (SAN), as shown inFIG. 4, or some other suitable network type. The storage system manager412 may also communicate with one or more host systems (not shown)through a host interface 414, which may or may not be a part of thestorage system manager 412. The storage system manager 412 and/or anyother component of the storage system 400 may be implemented in hardwareand/or software, and may make use of a processor (not shown) forexecuting commands of a type known in the art, such as a centralprocessing unit (CPU), a field programmable gate array (FPGA), anapplication specific integrated circuit (ASIC), etc. Of course, anyarrangement of a storage system may be used, as will be apparent tothose of skill in the art upon reading the present description.

In more embodiments, the storage system 400 may include any number ofdata storage tiers, and may include the same or different storage memorymedia within each storage tier. For example, each data storage tier mayinclude the same type of storage memory media, such as HDDs, SSDs,sequential access media (tape in tape drives, optical disk in opticaldisk drives, etc.), direct access media (CD-ROM, DVD-ROM, etc.), or anycombination of media storage types. In one such configuration, a higherstorage tier 402, may include a majority of SSD storage media forstoring data in a higher performing storage environment, and remainingstorage tiers, including lower storage tier 406 and additional storagetiers 416 may include any combination of SSDs, HDDs, tape drives, etc.,for storing data in a lower performing storage environment. In this way,more frequently accessed data, data having a higher priority, dataneeding to be accessed more quickly, etc., may be stored to the higherstorage tier 402, while data not having one of these attributes may bestored to the additional storage tiers 416, including lower storage tier406. Of course, one of skill in the art, upon reading the presentdescriptions, may devise many other combinations of storage media typesto implement into different storage schemes, according to theembodiments presented herein.

According to some embodiments, the storage system (such as 400) mayinclude logic configured to receive a request to open a data set, logicconfigured to determine if the requested data set is stored to a lowerstorage tier 406 of a tiered data storage system 400 in multipleassociated portions, logic configured to move each associated portion ofthe requested data set to a higher storage tier 402 of the tiered datastorage system 400, and logic configured to assemble the requested dataset on the higher storage tier 402 of the tiered data storage system 400from the associated portions.

Of course, this logic may be implemented as a method on any deviceand/or system or as a computer program product, according to variousembodiments.

Now referring to FIG. 5, a flowchart of a method 500 is shown accordingto one embodiment. The method 500 may be performed in accordance withthe present invention in any of the environments depicted in FIGS. 1-4,among others, in various embodiments. Of course, more or less operationsthan those specifically described in FIG. 5 may be included in method500, as would be understood by one of skill in the art upon reading thepresent descriptions.

Each of the steps of the method 500 may be performed by any suitablecomponent of the operating environment. For example, in variousembodiments, the method 500 may be partially or entirely performed byone or more servers, computers, or some other device having one or moreprocessors therein. The processor, e.g., processing circuit(s), chip(s),and/or module(s) implemented in hardware and/or software, and preferablyhaving at least one hardware component may be utilized in any device toperform one or more steps of the method 500. Illustrative processorsinclude, but are not limited to, a central processing unit (CPU), anapplication specific integrated circuit (ASIC), a field programmablegate array (FPGA), etc., combinations thereof, or any other suitablecomputing device known in the art.

As shown in FIG. 5, method 500 may initiate with operation 502, where anevent associated with data stored in a data storage system isidentified. In one embodiment, the event may include a junction in adata path of the data storage system. For example, the event may includeone or more of the opening, closing, creation, destruction, moving,renaming, etc. of a predetermined file and/or object within the datastorage system. In another example, the event may include a changing ofone or more attributes (e.g., ownership, access controls, etc.) of afile, a changing of extended attributes for the file, etc.

Additionally, in one embodiment, the event may include a junction in acontrol path of the data storage system. For example, the event mayinclude the moving of one or more predetermined files to rebalancestorage space. In another example, the event may include an addition ofone or more new disks to the data storage system. In yet anotherexample, the event may include the moving of one or more predeterminedfiles between storage tiers as files age/need to be cached within thedata storage system.

Further, in one embodiment, the event may include a junction associatedwith a hardware environment of the data storage system. For example, theevent may include an instance where the data storage system administersand/or manages underlying hardware within the data storage system (e.g.,as it responds to one or more environmental factors, etc.). In anotherexample, the event may include a turning off or on one or more diskswithin the data storage system due to a temperature increase/decreasewithin a data center. In yet another example, the event may include adisk failure within a data center associated with the data storagesystem.

Further still, in one embodiment, the event may be identified utilizingone or more hooks. For example, one or more hooks implemented within thedata storage system may intercept one or more of function calls,messages, and events passed between software components within the datastorage system. In another example, the information retrieved from oneor more hooks may be analyzed in order to identify the event.

Also, in one embodiment, the data storage system may include a systemthat implements a computer data storage architecture. For example, thedata storage system may include a distributed and/or clustered filesystem (e.g., a clustered file system that includes a shared file systemmounted on a plurality of servers, etc.). In another embodiment, theevent may be identified utilizing a hardware framework within the datastorage system (e.g., where the framework includes one or more hardwareprocessors, etc.).

Further still, method 500 may proceed with operation 504, where a policyrule is determined that is triggered in response to the event. In oneembodiment, determining the policy rule may include comparing aplurality of policy rules to the event to determine a match. Forexample, each of a plurality of policy rules may be compared to theevent in order to find a policy rule condition that evaluates to “true.”In another example, the match may include an event specified by thepolicy rule that triggers the policy rule.

Furthermore, in one embodiment, the policy rules may be written in ahigh level language (e.g., structured query language (SQL), etc.). Inanother embodiment, each of the policy rules may include a triggeringevent, and one or more actions to be implemented in response to thetriggering event. In yet another embodiment, the policy rules may beimplemented as part of a policy rules subsystem within the data storagesystem.

Further still, in one embodiment, the policy rules may be persistent(e.g., non-volatile, able to be accessed after end of process thatcreated them, etc.). For example, the policy rules may be reloaded intothe data storage system each time a file system is mounted for the datastorage system. In another embodiment, the policy rules may apply to allnodes within a cluster within the data storage system. In yet anotherembodiment, the policy rules may be associated with specificpredetermined data within the data storage system. For example, thepolicy rules may be associated with a subtree of data within the datastorage system, one or more specific files, ranges of data within one ormore files, etc. within the data storage system.

Also, in one embodiment, determining the policy rule may includeidentifying metadata associated with the event. For example, themetadata may include one or more file attributes of the data (e.g., afile name, path, file size, offset, inode number, etc.). In anotherexample, the metadata may include one or more attributes of one or moreusers associated with the event (e.g., a user ID of a user who initiatedthe event, etc.).

In yet another example, the metadata may include one or morecharacteristics of the event. For example, the metadata may include atime of the event, which process initiated the event, etc. In anotherexample, when the event includes a movement of data, the metadata mayinclude source and target storage tier names. In yet another example,the metadata may include an identification of one or more components ofthe data storage system (e.g., an identification of racks within a datacenter of a data storage system, etc.). In still another example, themetadata may include an indication of data read, written, and/or alteredduring the event.

Additionally, in one embodiment, the policy rules may be compared to themetadata in order to determine a match. In another embodiment, thepolicy rule may be determined utilizing a hardware framework within thedata storage system (e.g., where the framework includes one or morehardware processors, etc.).

In addition, method 500 may proceed with operation 506, where one ormore actions are implemented, according to the policy rule. In oneembodiment, the one or more actions may include an initiation of anexternal process (e.g., an application, etc.). For example, the one ormore actions may be implemented utilizing one or more processing threadswithin the data storage system. In another example, the external processmay include an analytical workflow, an antivirus scan, etc.

Further still, in one embodiment, the one or more actions may includerunning one or more internal subroutines within the data storage system.For example, the one or more subroutines may set a state on one or morefiles within the data storage system or internal data of the datastorage system. In another example, the one or more subroutines mayinitiate one or more checkpoints, snapshots, etc.

In yet another example, the one or more subroutines may manipulate datawithin the data storage system. For instance, the one or moresubroutines may move data to a new location (e.g., a new tier) within astorage hierarchy of the data storage system. In another instance, theone or more subroutines may change a state of one or more files withinthe data storage system.

Also, in one embodiment, the one or more actions may include enqueueingan event onto an external queue. In another embodiment, the one or moreactions may include logging the event (e.g., storing the event in a logor message queue, etc.). In yet another embodiment, the one or moreactions may include a sending of a notification to one or more users.For example, the contents of the notification may be dictated by thepolicy rule.

In addition, in one embodiment, the one or more actions may includechanging an internal state of the data storage system. In anotherembodiment, the one or more actions may include retrieving metadataassociated with the event. For example, the metadata may be reported,utilized in implementing the one or more actions, etc.

Furthermore, in one embodiment, the one or more actions may be performedsynchronously or asynchronously. For example, the synchronous actionsmay hold a thread that calls the one or more actions until the eventcompletes. In this way, the thread may be intercepted and failed ifdesired. For example, the one or more actions may include interceptingand failing the event. In another example, the asynchronous actions maybe performed at any time during the implementation or after thecompletion of the event. In another embodiment, the one or more actionsmay be implemented utilizing a hardware framework within the datastorage system (e.g., where the framework includes one or more hardwareprocessors, etc.).

In this way, the functionality of the data storage system may be easily,flexibly, and safely augmented in response to events as they occur. Thedata storage system may also interact with a wide variety of externaldata managers that provide various functionality such as auditing,billing, access control, intrusion detection, hierarchical storagemanagement, tiering, data distribution, etc.

Now referring to FIG. 6, a flowchart of a method 600 for creating andstoring a policy rule within a data storage system is shown, accordingto one embodiment. The method 600 may be performed in accordance withthe present invention in any of the environments depicted in FIGS. 1-4,among others, in various embodiments. Of course, more or less operationsthan those specifically described in FIG. 6 may be included in method600, as would be understood by one of skill in the art upon reading thepresent descriptions.

Each of the steps of the method 600 may be performed by any suitablecomponent of the operating environment. For example, in variousembodiments, the method 600 may be partially or entirely performed byone or more servers, computers, or some other device having one or moreprocessors therein. The processor, e.g., processing circuit(s), chip(s),and/or module(s) implemented in hardware and/or software, and preferablyhaving at least one hardware component may be utilized in any device toperform one or more steps of the method 600. Illustrative processorsinclude, but are not limited to, a central processing unit (CPU), anapplication specific integrated circuit (ASIC), a field programmablegate array (FPGA), etc., combinations thereof, or any other suitablecomputing device known in the art.

As shown in FIG. 6, method 600 may initiate with operation 602, where apolicy rule input by a user is received. In one embodiment, the policyrule may be input utilizing a high level language. For example, thepolicy rule may include one or more SQL expressions. In anotherembodiment, the policy rule may specify an event occurring within anentirety of the data storage system. For example, the event may bespecified utilizing a “where” clause within the policy rule.

Additionally, in one embodiment, the policy rule may reference one ormore properties and/or attributes of a file within a data storagesystem. For example, the properties and/or attributes may be stored asmetadata in associated with the file within the data storage system. Inanother example, the properties and/or attributes may include one ormore of a file name, file path, file size, file offset, file range, fileset name, user ID, group ID, storage pool name, extended attributes ofthe file, inode number, modification time, current time, caller ID, etc.

Further, in one embodiment, the policy rule may include an array ofvalues representative of a file within the data storage system. Forexample, the policy rule may include one or more variables indicatingdata within a file, an offset of the data within the file, a length ofthe data within the file, etc. In another embodiment, the policy rulemay include an identification of one or more predetermined propertiesand/or attributes of the file within a data storage system.

Further still, in one embodiment, the policy rule may include adependency on one or more actions (e.g., contents of a file and/or databeing read or written by a predetermined operation within the datastorage system, etc.). In another example, the policy rule may includeone or more variables identifying data being read, written, etc. In yetanother example, the policy rule may include an identification of anoccurrence of the one or more actions.

Also, in one embodiment, the policy rule may specify an action to beexecuted in response to an occurrence of the event. For example, theaction may include an invocation of an external process or command. Inanother example, the action may include an invocation of a remoteprocedure call, where the procedure call may be synchronous orasynchronous. In another example, the action may include storing anannotation of the event. For example, the annotated event may capture amethod of invocation of a process that performed an action, and theannotated event may be stored in a log or message queue.

In addition, in one embodiment, the policy rule may include one or moretransactional semantics for the data storage system. For example, thetransactional semantics may specify that if an action to be executedfails, either the event completes and is logged, or the event does notcomplete and is not logged.

Furthermore, method 600 may proceed with operation 604, where the policyrule is tagged with a name indicating a type of event to which thepolicy rule applies. Further still, method 600 may proceed withoperation 606, where the policy rule is persistently stored in anordered list of policy rules that is evaluated at each junction in thedata path of the data storage system. For example, the policy rules maybe stored persistently and may be reloaded each time the file system ismounted.

In this way, a user may implement a set of policy rules to specifyevents of interest, as well as actions to be executed in response tothose events

Now referring to FIG. 7, a flowchart of a method 700 for triggering andimplementing a policy rule within a data storage system is shown,according to one embodiment. The method 700 may be performed inaccordance with the present invention in any of the environmentsdepicted in FIGS. 1-4, among others, in various embodiments. Of course,more or less operations than those specifically described in FIG. 7 maybe included in method 700, as would be understood by one of skill in theart upon reading the present descriptions.

Each of the steps of the method 700 may be performed by any suitablecomponent of the operating environment. For example, in variousembodiments, the method 700 may be partially or entirely performed byone or more servers, computers, or some other device having one or moreprocessors therein. The processor, e.g., processing circuit(s), chip(s),and/or module(s) implemented in hardware and/or software, and preferablyhaving at least one hardware component may be utilized in any device toperform one or more steps of the method 700. Illustrative processorsinclude, but are not limited to, a central processing unit (CPU), anapplication specific integrated circuit (ASIC), a field programmablegate array (FPGA), etc., combinations thereof, or any other suitablecomputing device known in the art.

As shown in FIG. 7, method 700 may initiate with operation 702, where ajunction within a control path of a data storage system is identified.In one embodiment, the junction may be identified utilizing a hookwithin the control path. In another embodiment, the junction mayindicate an event occurring within the data storage system.

Additionally, method 700 may proceed with operation 704, where dataassociated with the junction is retrieved. In one embodiment, the datamay include environment attributes. For example, the data may includedata describing one or more actions being performed. In anotherembodiment, the data may include a plurality of file attributes. Forexample, the data may include metadata describing files within the datastorage system that are associated with the one or more actions.

Further, method 700 may proceed with operation 706, where the data iscompared to a plurality of stored policy rules for the data storagesystem. In one embodiment, a “where” clause within the rule may becompared to data retrieved at the junction to determine if the ruleapplies to the current junction.

Further still, method 700 may proceed with operation 708, where a policyrule is determined that applies to the data associated with thejunction. For example, a match may be determined between the “where”clause of the policy rule and the data associated with the junction.

Also, method 700 may proceed with operation 710, where one or moreactions dictated by the policy rule that apply to the data associatedwith the junction are performed. In one embodiment, an “action” clauseof the applicable policy rule may be executed. In another embodiment,the one or more actions may be executed asynchronously or synchronously.

In this way, when a file is opened within a data storage system, thedata storage system may know who accessed the file, in what mode thefile was accessed, whether it was created, for how long it was open, howmany bytes were read/written, who is the owner of the file, what storagetier this file resides on etc. When a file/object is moved betweenstorage tiers or between storage pools within the data storage system,the data storage system may know about the source and the destination ofthe file/object, who moved it, when it was moved. When a sector in ahard disk becomes unreadable, the data storage system may know about itand may begin data recovery for affected data.

The information governing the above events may have value to componentsabove the storage systems. For example, auditing systems may be informedas to who accessed what files for how long. Cloud storage may billclients based on how much storage they consume—not just how muchstorage, but what storage (storage tier) as well, and this informationmay be provided/reported via the data storage system. Data centeradministrators may be kept informed, via the data storage system, aboutany hard disks that have gone bad so they can replace them.

Now referring to FIG. 8, a flowchart of a method 800 for dynamicallymanaging a storage tier of a data storage system is shown, according toone embodiment. The method 800 may be performed in accordance with thepresent invention in any of the environments depicted in FIGS. 1-4,among others, in various embodiments. Of course, more or less operationsthan those specifically described in FIG. 8 may be included in method800, as would be understood by one of skill in the art upon reading thepresent descriptions.

Each of the steps of the method 800 may be performed by any suitablecomponent of the operating environment. For example, in variousembodiments, the method 800 may be partially or entirely performed byone or more servers, computers, or some other device having one or moreprocessors therein. The processor, e.g., processing circuit(s), chip(s),and/or module(s) implemented in hardware and/or software, and preferablyhaving at least one hardware component may be utilized in any device toperform one or more steps of the method 800. Illustrative processorsinclude, but are not limited to, a central processing unit (CPU), anapplication specific integrated circuit (ASIC), a field programmablegate array (FPGA), etc., combinations thereof, or any other suitablecomputing device known in the art.

As shown in FIG. 8, method 800 may initiate with operation 802, where anevent associated with a storage tier of a data storage system isidentified. In one embodiment, the storage tier may include a type ofstorage available within the data storage system that allows faster datareading and writing than other storage available within the data storagesystem. In another embodiment, each file within the data storage systemmay be assigned to a storage tier within the data storage system. Forexample, the assigned storage tier for a file may be stored in an inodeof the file.

Additionally, in one embodiment, the storage tier may include a burstbuffer within the data storage system. For example, the burst buffer mayinclude rapidly accessed persistent memory (e.g., non-volatilerandom-access memory (NVRAM), etc.) within the data storage system. Inanother embodiment, the event may include a file event (e.g., a fileopen event, a file close event, a file delete event, a file createevent, etc.) on a file. For example, the file may include a file used torebuild data after data corruption or an unexpected shutdown. In anotherexample, the file may be identified using metadata, and may be used torebuild database tables in memory after data loss event.

Further, in one embodiment, the event may include an indication that astorage tier of the data storage system is almost full (e.g., within apredetermined percentage of complete usage, etc.). For example, theevent may be identified by determining an available space within thestorage tier and comparing the available space to a threshold. If theavailable space is below a threshold, the storage tier may be determinedto be almost full and the event may be initiated.

Further still, in one embodiment, the event may include an indicationthat a new file is stored (or to be stored) in the storage tier. Forexample, the event may include receipt of a request to store a filewithin the storage tier of the data system. In another embodiment, theevent may be identified utilizing one or more hooks. For example, a hookmay be incorporated into the data storage system, where the hookproduces an event when a file moves between storage tiers (e.g., from alow speed storage tier (e.g., a tape drive, a hard disk drive, etc.) toa storage tier, etc.).

Also, method 800 may proceed with operation 804, where a policy rulethat is triggered in response to the event is determined. In addition,method 800 may proceed with operation 806, where one or more datamanagement actions associated with the storage tier are implemented,according to the policy rule.

Furthermore, in one embodiment, the one or more actions may includemoving data from one storage tier to another storage tier of the datastorage system, in response to a file event (e.g., a file open event, afile close event, a file delete event, a file create event, etc.). Forexample, data may be moved from a burst buffer to a slower storage (harddrive storage, tape storage, etc.). In another embodiment, the moving ofthe data may be performed in response to the file event on the file. Forexample, the file may be removed from the storage tier and placed in alower speed storage tier, in response to the file close event.

Further still, in one embodiment, the one or more actions may includedestaging (e.g., moving, etc.) data to another tier within the datastorage system (e.g., a lower speed storage tier, etc.). For example,the tier may be indicated within an attribute of the data (e.g., withinan inode of a file, etc.). In another embodiment, the destaging may beperformed in response to the indication that the storage tier of thedata storage system is almost full.

Also, in one embodiment, the assigned storage tier for a file may bestored in the inode of the file. In another embodiment, when the file isopened, the inode may be cached in memory. In yet another embodiment,when the file is closed, the inode may remain cached until it is evictedfrom memory as a least recently used inode. In still another embodiment,the data storage system may determine the assigned storage tier for afile from the cached inode, which may expedite the destaging process.

Additionally, in one embodiment, the one or more actions may includedetermining a priority for a file, and managing the file within thestorage tier, based on the priority. For example, the managing may beperformed in response to an indication that a new file is stored (or tobe stored) in the storage tier. In another embodiment, the priority maybe determined utilizing metadata for the file (e.g., ownership or accesscredentials, etc.). In yet another embodiment, each user (e.g., tenant)of the data storage system may be allocated a predetermined amount ofspace within the storage tier, according to a priority of the user. Instill another embodiment, this priority may influence an order in whichfiles are removed (e.g., evicted, etc.) from the storage tier. Forexample, files with a higher priority may be removed from the storagetier later than files with a lower priority.

Further, in one embodiment, the one or more actions may include logginginformation for a file. For example, the logging may be performed inresponse to an indication that a new file is stored (or to be stored) inthe storage tier. In another embodiment, the information may be loggedto a reserved metadata file written to non-volatile media. In this way,a list of all files stored within the storage tier may be maintained.

Further still, in one embodiment, non-volatile media may be used toreinstate the storage tier after a node failure. For example, the nodefailure may include a crash of one or more components of the datastorage system, corruption within the data storage system, etc. Inanother example, metadata such as inodes of recently opened files in thestorage tier, the LRU list, and LRU counters may be written tonon-volatile media. During recovery such a failure, this metadata may befetched from the non-volatile media and thus, the contents of the highspeed tier may be reinstated. In another embodiment, the reservedmetadata file may be accessed during run time to determine files thatshould be cached in memory within the data storage system.

In this way, the data storage system may be tuned to optimize thestorage tier. More specifically, predetermined policy rules within thedata storage system may be directed toward the storage tier and mayenable optimized usage of the storage tier without any knowledge of theactual hardware behind the storage tier.

Now referring to FIG. 9, a flowchart of a method 900 for dynamicallymanaging a file event on a file is shown, according to one embodiment.The method 900 may be performed in accordance with the present inventionin any of the environments depicted in FIGS. 1-4, among others, invarious embodiments. Of course, more or less operations than thosespecifically described in FIG. 9 may be included in method 900, as wouldbe understood by one of skill in the art upon reading the presentdescriptions.

Each of the steps of the method 900 may be performed by any suitablecomponent of the operating environment. For example, in variousembodiments, the method 900 may be partially or entirely performed byone or more servers, computers, or some other device having one or moreprocessors therein. The processor, e.g., processing circuit(s), chip(s),and/or module(s) implemented in hardware and/or software, and preferablyhaving at least one hardware component may be utilized in any device toperform one or more steps of the method 900. Illustrative processorsinclude, but are not limited to, a central processing unit (CPU), anapplication specific integrated circuit (ASIC), a field programmablegate array (FPGA), etc., combinations thereof, or any other suitablecomputing device known in the art.

As shown in FIG. 9, method 900 may initiate with operation 902, where afile event on a file is identified within a data storage system, wheredata associated with the file is stored in a first storage tier of thedata storage system. For example, a hook within a control path or datapath of the data storage system may detect a request to close a file asa junction within the data storage system. In one embodiment, the fileevent may include a file open event, a file close event, a file deleteevent, a file create event, etc.

Additionally, method 900 may proceed with operation 904, where the fileevent is compared to a plurality of stored policy rules for the datastorage system to identify a policy rule that is triggered by the event.Further, method 900 may proceed with operation 906, where the policyrule that is triggered destages the file by moving data associated withthe file from the first storage tier of the data storage system to asecond storage tier of the data storage system. In this way, more spacemay be made available within the first storage tier.

Now referring to FIG. 10, a flowchart of a method 1000 for dynamicallymanaging a burst buffer is shown, according to one embodiment. Themethod 1000 may be performed in accordance with the present invention inany of the environments depicted in FIGS. 1-4, among others, in variousembodiments. Of course, more or less operations than those specificallydescribed in FIG. 10 may be included in method 1000, as would beunderstood by one of skill in the art upon reading the presentdescriptions.

Each of the steps of the method 1000 may be performed by any suitablecomponent of the operating environment. For example, in variousembodiments, the method 1000 may be partially or entirely performed byone or more servers, computers, or some other device having one or moreprocessors therein. The processor, e.g., processing circuit(s), chip(s),and/or module(s) implemented in hardware and/or software, and preferablyhaving at least one hardware component may be utilized in any device toperform one or more steps of the method 1000. Illustrative processorsinclude, but are not limited to, a central processing unit (CPU), anapplication specific integrated circuit (ASIC), a field programmablegate array (FPGA), etc., combinations thereof, or any other suitablecomputing device known in the art.

As shown in FIG. 10, method 1000 may initiate with operation 1002, wherean event is identified that indicates that a burst buffer of the datastorage system is close to being full. For example, a comparison may bemade between a currently available space within the burst buffer and apredetermined threshold, where such comparison may result in anindication that the burst buffer is close to being full. This indicationmay be detected by a hook within a control path or data path of the datastorage system.

Additionally, method 1000 may proceed with operation 1004, where theevent is compared to a plurality of stored policy rules for the datastorage system to identify a policy rule that is triggered by the event.Further, method 1000 may proceed with operation 1006, where the policyrule that is triggered destages data by moving data within the burstbuffer to a low speed storage tier of the data storage system, accordingto attributes of each file within the burst buffer.

For example, each file within the data storage system may be assigned toa storage tier, and this assignment may be stored as an attribute in thefile's inode. Files that are open and being used by a user may havetheir inodes cached in memory, and when the file is closed, the inodemay remain cached until it becomes the least recently used inode and isevicted from memory. This inode caching mechanism may be utilized tofind out what storage tier the file current resides in, which mayexpedite the destaging process because the cached inodes are consulted,instead of an on-disk copy of the inode.

Now referring to FIG. 11, a flowchart of a method 1100 for adding a fileto a burst buffer is shown, according to one embodiment. The method 1100may be performed in accordance with the present invention in any of theenvironments depicted in FIGS. 1-4, among others, in variousembodiments. Of course, more or less operations than those specificallydescribed in FIG. 11 may be included in method 1100, as would beunderstood by one of skill in the art upon reading the presentdescriptions.

Each of the steps of the method 1100 may be performed by any suitablecomponent of the operating environment. For example, in variousembodiments, the method 1100 may be partially or entirely performed byone or more servers, computers, or some other device having one or moreprocessors therein. The processor, e.g., processing circuit(s), chip(s),and/or module(s) implemented in hardware and/or software, and preferablyhaving at least one hardware component may be utilized in any device toperform one or more steps of the method 1100. Illustrative processorsinclude, but are not limited to, a central processing unit (CPU), anapplication specific integrated circuit (ASIC), a field programmablegate array (FPGA), etc., combinations thereof, or any other suitablecomputing device known in the art.

As shown in FIG. 11, method 1100 may initiate with operation 1102, wherean event is identified that indicates that a new file is being broughtinto a burst buffer of the data storage system. For example, a requestmay be detected by a hook within a control path or data path of the datastorage system, where the request includes a request to transfer thefile into the burst buffer from another storage location within the datastorage system.

Additionally, method 1100 may proceed with operation 1104, where theevent is compared to a plurality of stored policy rules for the datastorage system to identify a policy rule that is triggered by the event.Further, method 1100 may proceed with operation 1106, where, accordingto the policy rule that is triggered, details for the file aredetermined using ownership or access credentials or other fileattributes (e.g., extended attributes, a project name, file namingschemes, etc.), and the details for the file are logged in a reservedmetadata file written to non-volatile media.

For example, the details for the file may include a priority that isdetermined for the file based on the ownership or access credentials forthe file. In another example, each tenant that has access to the burstbuffer may be allocated space proportional to a priority assigned tothat tenant. This priority may be stored within ownership or accesscredentials for each file associated with a tenant.

Further, in one embodiment, all files with data in node caches or highspeed tiers may have their inodes cached in memory. After a nodefailure, the contents of each high speed tier may need to be restored towhat it was before failure. By logging these events in a specialreserved metadata file, the file system may maintain a list of all thefiles that were in the high speed tier/cache before the crash. Duringrecovery, the reserved metadata file may be read and those files rereadinto the tier. The same non-volatile list may also be consulted at runtime to determine what set of files should be cached in memory, ratherthan assuming all inodes in the high speed tier will fit into memory.

The present invention may be a system, a method, and/or a computerprogram product. The computer program product may include a computerreadable storage medium (or media) having computer readable programinstructions thereon for causing a processor to carry out aspects of thepresent invention.

The computer readable storage medium can be a tangible device that canretain and store instructions for use by an instruction executiondevice. The computer readable storage medium may be, for example, but isnot limited to, an electronic storage device, a magnetic storage device,an optical storage device, an electromagnetic storage device, asemiconductor storage device, or any suitable combination of theforegoing. A non-exhaustive list of more specific examples of thecomputer readable storage medium includes the following: a portablecomputer diskette, a hard disk, a random access memory (RAM), aread-only memory (ROM), an erasable programmable read-only memory (EPROMor Flash memory), a static random access memory (SRAM), a portablecompact disc read-only memory (CD-ROM), a digital versatile disk (DVD),a memory stick, a floppy disk, a mechanically encoded device such aspunch-cards or raised structures in a groove having instructionsrecorded thereon, and any suitable combination of the foregoing. Acomputer readable storage medium, as used herein, is not to be construedas being transitory signals per se, such as radio waves or other freelypropagating electromagnetic waves, electromagnetic waves propagatingthrough a waveguide or other transmission media (e.g., light pulsespassing through a fiber-optic cable), or electrical signals transmittedthrough a wire.

Computer readable program instructions described herein can bedownloaded to respective computing/processing devices from a computerreadable storage medium or to an external computer or external storagedevice via a network, for example, the Internet, a local area network, awide area network and/or a wireless network. The network may comprisecopper transmission cables, optical transmission fibers, wirelesstransmission, routers, firewalls, switches, gateway computers and/oredge servers. A network adapter card or network interface in eachcomputing/processing device receives computer readable programinstructions from the network and forwards the computer readable programinstructions for storage in a computer readable storage medium withinthe respective computing/processing device.

Computer readable program instructions for carrying out operations ofthe present invention may be assembler instructions,instruction-set-architecture (ISA) instructions, machine instructions,machine dependent instructions, microcode, firmware instructions,state-setting data, or either source code or object code written in anycombination of one or more programming languages, including an objectoriented programming language such as Smalltalk, C++ or the like, andconventional procedural programming languages, such as the “C”programming language or similar programming languages. The computerreadable program instructions may execute entirely on the user'scomputer, partly on the user's computer, as a stand-alone softwarepackage, partly on the user's computer and partly on a remote computeror entirely on the remote computer or server. In the latter scenario,the remote computer may be connected to the user's computer through anytype of network, including a local area network (LAN) or a wide areanetwork (WAN), or the connection may be made to an external computer(for example, through the Internet using an Internet Service Provider).In some embodiments, electronic circuitry including, for example,programmable logic circuitry, field-programmable gate arrays (FPGA), orprogrammable logic arrays (PLA) may execute the computer readableprogram instructions by utilizing state information of the computerreadable program instructions to personalize the electronic circuitry,in order to perform aspects of the present invention.

Aspects of the present invention are described herein with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems), and computer program products according to embodiments of theinvention. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer readable program instructions.

These computer readable program instructions may be provided to aprocessor of a general purpose computer, special purpose computer, orother programmable data processing apparatus to produce a machine, suchthat the instructions, which execute via the processor of the computeror other programmable data processing apparatus, create means forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks. These computer readable program instructionsmay also be stored in a computer readable storage medium that can directa computer, a programmable data processing apparatus, and/or otherdevices to function in a particular manner, such that the computerreadable storage medium having instructions stored therein includes anarticle of manufacture including instructions which implement aspects ofthe function/act specified in the flowchart and/or block diagram blockor blocks.

The computer readable program instructions may also be loaded onto acomputer, other programmable data processing apparatus, or other deviceto cause a series of operational steps to be performed on the computer,other programmable apparatus or other device to produce a computerimplemented process, such that the instructions which execute on thecomputer, other programmable apparatus, or other device implement thefunctions/acts specified in the flowchart and/or block diagram block orblocks.

The flowchart and block diagrams in the Figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods, and computer program products according to variousembodiments of the present invention. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof instructions, which includes one or more executable instructions forimplementing the specified logical function(s). In some alternativeimplementations, the functions noted in the block may occur out of theorder noted in the figures. For example, two blocks shown in successionmay, in fact, be executed substantially concurrently, or the blocks maysometimes be executed in the reverse order, depending upon thefunctionality involved. It will also be noted that each block of theblock diagrams and/or flowchart illustration, and combinations of blocksin the block diagrams and/or flowchart illustration, can be implementedby special purpose hardware-based systems that perform the specifiedfunctions or acts or carry out combinations of special purpose hardwareand computer instructions.

Moreover, a system according to various embodiments may include aprocessor and logic integrated with and/or executable by the processor,the logic being configured to perform one or more of the process stepsrecited herein. By integrated with, what is meant is that the processorhas logic embedded therewith as hardware logic, such as an applicationspecific integrated circuit (ASIC), a FPGA, etc. By executable by theprocessor, what is meant is that the logic is hardware logic; softwarelogic such as firmware, part of an operating system, part of anapplication program; etc., or some combination of hardware and softwarelogic that is accessible by the processor and configured to cause theprocessor to perform some functionality upon execution by the processor.Software logic may be stored on local and/or remote memory of any memorytype, as known in the art. Any processor known in the art may be used,such as a software processor module and/or a hardware processor such asan ASIC, a FPGA, a central processing unit (CPU), an integrated circuit(IC), a graphics processing unit (GPU), etc.

It will be clear that the various features of the foregoing systemsand/or methodologies may be combined in any way, creating a plurality ofcombinations from the descriptions presented above.

It will be further appreciated that embodiments of the present inventionmay be provided in the form of a service deployed on behalf of acustomer to offer service on demand.

While various embodiments have been described above, it should beunderstood that they have been presented by way of example only, and notlimitation. Thus, the breadth and scope of a preferred embodiment shouldnot be limited by any of the above-described exemplary embodiments, butshould be defined only in accordance with the following claims and theirequivalents.

What is claimed is:
 1. A computer-implemented method, comprising:identifying an event associated with data stored in a data storagesystem; determining a policy rule that is triggered in response to theevent; and implementing one or more actions according to the policyrule.
 2. The computer-implemented method of claim 1, wherein the eventincludes a junction in a data or control path of the data storagesystem.
 3. The computer-implemented method of claim 1, wherein the eventis identified utilizing one or more hooks.
 4. The computer-implementedmethod of claim 1, wherein determining the policy rule includescomparing a plurality of policy rules to the event to determine a match.5. The computer-implemented method of claim 1, wherein the policy ruleincludes a triggering event, and one or more actions to be implementedin response to the triggering event.
 6. The computer-implemented methodof claim 1, wherein the policy rule is persistent.
 7. Thecomputer-implemented method of claim 1, wherein the policy rule isassociated with specific predetermined data within the data storagesystem.
 8. The computer-implemented method of claim 1, whereindetermining the policy rule includes identifying metadata associatedwith the event, and comparing a plurality of policy rules to themetadata in order to determine a match.
 9. The computer-implementedmethod of claim 1, wherein the one or more actions include an initiationof an external process.
 10. The computer-implemented method of claim 1,wherein the one or more actions include logging the event.
 11. Thecomputer-implemented method of claim 1, wherein the one or more actionsare performed synchronously or asynchronously.
 12. Thecomputer-implemented method of claim 1, wherein the one or more actionsinclude intercepting and failing the event.
 13. The computer-implementedmethod of claim 1, wherein the one or more actions include enqueueing anevent onto an external queue.
 14. The computer-implemented method ofclaim 1, wherein the one or more actions include storing an annotationof the event.
 15. A computer program product for dynamically reacting toevents within a data storage system, the computer program productcomprising a computer readable storage medium having programinstructions embodied therewith, wherein the computer readable storagemedium is not a transitory signal per se, the program instructionsexecutable by a processor to cause the processor to perform a methodcomprising: identifying an event associated with data stored in the datastorage system, utilizing the processor; determining a policy rule thatis triggered in response to the event, utilizing the processor; andimplementing one or more actions according to the policy rule, utilizingthe processor.
 16. The computer program product of claim 15, wherein theevent includes a junction in a data or control path of the data storagesystem.
 17. The computer program product of claim 15, wherein the eventis identified utilizing one or more hooks.
 18. The computer programproduct of claim 15, wherein determining the policy rule includescomparing a plurality of policy rules to the event to determine a match.19. The computer program product of claim 15, wherein the policy ruleincludes a triggering event, and one or more actions to be implementedin response to the triggering event.
 20. The computer program product ofclaim 15, wherein the policy rule is persistent.
 21. The computerprogram product of claim 15, wherein the policy rule is associated withspecific predetermined data within the data storage system.
 22. Thecomputer program product of claim 15, wherein determining the policyrule includes identifying metadata associated with the event, andcomparing a plurality of policy rules to the metadata in order todetermine a match.
 23. A system, comprising: a processor; and logicintegrated with the processor, executable by the processor, orintegrated with and executable by the processor, the logic beingconfigured to: identify an event associated with data stored in a datastorage system; determine a policy rule that is triggered in response tothe event; and implement one or more actions according to the policyrule.
 24. A computer-implemented method, comprising: receiving, at adata storage system, a policy rule input by a user; tagging, at the datastorage system, the policy rule with a name indicating a type of eventto which the policy rule applies; and persistently storing the policyrule in an ordered list of policy rules that is evaluated at eachjunction in a data path of the data storage system.
 25. Acomputer-implemented method, comprising: identifying a junction within acontrol path of a data storage system; retrieving data associated withthe junction; comparing the data to a plurality of stored policy rulesfor the data storage system; determining a policy rule that applies tothe data associated with the junction; and performing one or moreactions dictated by the policy rule that apply to the data associatedwith the junction.